#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
long long n,ans,rmax;
long long a[N],v[N];
bool compare(long long a,long long b ){
	return a<b;
}
void dfs(int d){
//	cout<<a[d]<<" "<<d<<" "<<"1*"<<endl;
	if(d==n)
		return ;
	if(a[d]==-1)
		dfs(d+1);
	for(long long i=d+1;i<=n;i++)
	{
		if(a[d]<a[i]&&v[i]==0&&v[d]==0&&a[d]!=-1)
		{
//			cout<<a[d]<<" "<<a[i]<<" "<<d<<endl;
			ans--;
			a[d]=-1;
			v[d]=-1;
			v[i]=1;
			dfs(d+1);
		}
		else if(a[d]==a[i]&&i==n)
			return ;
	}
}
int main(){
	freopen("duel.in","r",stdin);
	freopen("duel.out","w",stdout);
	scanf(" %lld",&n);
	ans=n;
	for(long long i=1;i<=n;i++)
	{
		scanf(" %lld",&a[i]);
	}
	sort(a+1,a+n+1,compare);
	//for(int i=1;i<=n;i++)
	//{
		//cout<<a[i]<<endl;
	//}
	for(long long i=1;i<=n;i++)
	{
//		cout<<"2*"<<endl;
		if(a[i]!=-1)
			dfs(i);
	}
	printf("%lld",ans);
	return 0;
}

